The Generalized DCell Network Structures and Their Graph Properties

نویسندگان

  • Markus Kliegl
  • Jason Lee
  • Jun Li
  • Xinchao Zhang
  • David Rincón
  • Chuanxiong Guo
چکیده

DCell [7] has been proposed as a server centric network structure for data centers. DCell can support millions of servers with high network capacity and provide good fault tolerance by only using commodity mini-switches. In this paper, we show that DCell is only a special case of a more generalized DCell structure. We give the generalized DCell construction rule and several new DCell structures. We analyze the graph properties, including the closed form of number of servers, bisection width, diameter, and symmetry, of the generalized DCell structure. Furthermore, we show that the new structures are more symmetric, have much smaller diameter, and provide much better load-balancing than the original DCell by using shortestpath routing. We demonstrate the load-balancing property of the new structures by analysis and extensive simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph product of generalized Cayley graphs over polygroups

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

متن کامل

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

متن کامل

Cayley graph associated to a semihypergroup

The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first  we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as  Hamiltonian cycles in this  graph.  Also, by some of examples we will illustrate  the properties and behavior of  these Cayley  graphs, in particulars we show that ...

متن کامل

Hamiltonian Properties of DCell Networks

DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches. With one exception, we prove that a k level DCell built with n port switches is Hamiltonian-connected for k ≥ 0 and n ≥ 2. Our proof extends to all generalized DCell connection rules for n ≥ 3. Then, we...

متن کامل

Structural properties of fuzzy graphs

Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009